Computing shortest heterochromatic monotone routes
نویسندگان
چکیده
Given a set of n points on the plane colored with k ≤ n colors, the Trip Planning Problem asks for the shortest path visiting the k colors. It is a well-known NP-hard problem. We show that under some natural constraints on the path, the problem can be solved in polynomial time.
منابع مشابه
A heuristic fault-tolerant routing algorithm in mesh using rectilinear-monotone polygonal fault blocks
A new, rectilinear-monotone polygonally shaped fault block model, called Minimal-Connected-Component (MCC), was proposed in [D. Wang, A rectilinear-monotone polygonal fault block model for fault-tolerant minimal routing in mesh, IEEE Trans. Comput. 52 (3) (2003) 310–320] for minimal adaptive routing in mesh-connected multiprocessor systems. This model refines the widely used rectangular model b...
متن کاملEfficient Computation of Jogging Routes
We study the problem of computing jogging (running) routes in pedestrian networks: Given source vertex s and length L, it asks for a cycle (containing s) that approximates L while considering niceness criteria such as the surrounding area, shape of the route, and its complexity. Unfortunately, computing such routes is NP-hard, even if the only optimization goal is length. We therefore propose t...
متن کاملAn Alternative Approach to Alternative Routes: HiDAR Technical Report
Alternatives to a shortest path are a common feature for modern navigation providers. In contrast to modern speed-up techniques, which are based on the unique distance between two locations within the map, computing alternative routes that might include slightly suboptimal routes seems a way more difficult problem. Especially testing a possible alternative route for its quality can so far only ...
متن کاملComputing the Detour of Polygons
Let P be a simple polygon in 2 with n vertices. The detour of P between two points, p, q ∈ P , is the length of a shortest path contained in P and connecting p to q, divided by the distance of these points. The detour of the whole polygon is the maximum detour between any two points in P . We first analyze properties of pairs of points with maximum detour. Next, we use these properties to achie...
متن کاملOn Computing Shortest External Watchman Routes for Convex Polygons
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008